A quasi-paucity problem

On a Quasi-Ramsey problem

It is proved that if a graph G has at least cn log n vertices, then either G or its complement G contains a subgraph H with at least n vertices and minimum degree at least I V(H) I /2. This result is not far from being best possible, as is shown by a rather unusual random construction . Some related questions are also discussed .

Toward a paucity of poverty.

A Quasi-variational Inequality Problem in Superconductivity

We derive a class of analytical solutions and a dual formulation of a scalar two-space-dimensional quasi-variational inequality problem in applied superconductivity. We approximate this formulation by a fully practical ̄nite element method based on the lowest order Raviart Thomas element, which yields approximations to both the primal and dual variables (the magnetic and electric ̄elds). We prove...

Problem-based Learning, Multimedia, and a Paucity of Behavioral Issue Learning

Although the Institute of Medicine attributes significant mortality in the United States to behavioral and social issues, these topics are commonly not prioritized areas of learning by medical students. A common belief is that problem-based learning (PBL) is an effective method to stimulate learning in these areas. While examining the effects on behavioral and social issue learning of a multime...

Effect of Problem-solving Skills Training on Domestic Violence in Infertile Women: A Quasi-experimental Study

Background & Aims: A direct relationship between infertility in women and their exposure to domestic violence has been reported, and several interventions have been suggested to reduce the exposure to violence in infertile women. The current study aims to assess the effect of problem-solving skill training (PSST) on the exposure of Iranian infertile women to domestic violence. Materials & Meth...